Thomas Keller 0001
33 publications
7 venues
H Index 14
Affiliation
University of Basel, SwitzerlandAlbert-Ludwigs-Universit t Freiburg, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Landmark Progression in Heuristic Search.
|
ICAPS | 2023 | 0 |
| Learning and Exploiting Progress States in Greedy Best-First Search.
|
IJCAI | 2022 | 0 |
| Cost Partitioning Heuristics for Stochastic Shortest Path Problems.
|
ICAPS | 2022 | 0 |
| Dantzig-Wolfe Decomposition for Cost Partitioning.
|
ICAPS | 2021 | 1 |
| Saturated Post-hoc Optimization for Classical Planning.
|
AAAI | 2021 | 0 |
| Exploiting Cyclic Dependencies in Landmark Heuristics.
|
ICAPS | 2021 | 2 |
| Saturated Cost Partitioning for Optimal Classical Planning.
|
JAIR | 2020 | 25 |
| Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning.
|
IJCAI | 2020 | 2 |
| Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces.
|
SOCS | 2020 | 0 |
| Stochastic Planning with Lifted Symbolic Trajectory Optimization.
|
ICAPS | 2019 | 9 |
| Search Progress and Potentially Expanded States in Greedy Best-First Search.
|
IJCAI | 2018 | 1 |
| Best-Case and Worst-Case Behavior of Greedy Best-First Search.
|
IJCAI | 2018 | 9 |
| Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
|
AAAI | 2017 | 19 |
| A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.
|
ICAPS | 2017 | 22 |
| Understanding the Search Behaviour of Greedy Best-First Search.
|
SOCS | 2017 | 0 |
| Optimal Solutions to Large Logistics Planning Domain Problems.
|
SOCS | 2017 | 0 |
| State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning.
|
IJCAI | 2016 | 14 |
| Abstractions for Planning with State-Dependent Action Costs.
|
ICAPS | 2016 | 25 |
| Delete Relaxations for Planning with State-Dependent Action Costs.
|
SOCS | 2015 | 20 |
| Better Be Lucky than Good: Exceeding Expectations in MDP Evaluation.
|
AAAI | 2015 | 6 |
| Delete Relaxations for Planning with State-Dependent Action Costs.
|
IJCAI | 2015 | 0 |
| Balancing Exploration and Exploitation in Classical Planning.
|
SOCS | 2014 | 12 |
| Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games.
|
ECAI | 2014 | 7 |
| Trial-Based Heuristic Tree Search for Finite Horizon MDPs.
|
ICAPS | 2013 | 101 |
| PROST: Probabilistic Planning Based on UCT.
|
ICAPS | 2012 | 133 |
| Planning with Semantic Attachments: An Object-Oriented View.
|
ECAI | 2012 | 37 |
| A Planning Based Framework for Controlling Hybrid Systems.
|
ICAPS | 2012 | 41 |
| A Polynomial All Outcome Determinization for Probabilistic Planning.
|
ICAPS | 2011 | 17 |
| A system for interactive learning in dialogue with a tutor.
|
IROS | 2011 | 44 |
| High-Quality Policies for the Canadian Traveler's Problem.
|
AAAI | 2010 | 72 |
| Coming Up With Good Excuses: What to do When no Plan Can be Found.
|
ICAPS | 2010 | 113 |
| High-Quality Policies for the Canadian Traveler's Problem.
|
SOCS | 2010 | 0 |
| Semantic Attachments for Domain-Independent Planning Systems.
|
ICAPS | 2009 | 193 |